String and Sub-String Searching Using Inverted Indexes

ABSTRACT

Inverted indexes for terms and for term separators are separately provided to minimize data redundancy. Search queries are parsed to identify terms and term separators, if any, and the corresponding inverted indexes are searched for responsive documents. Related apparatus, systems, techniques and articles are also described.

CROSS REFERENCE TO RELATED APPLICATION

The application is a continuation of U.S. application Ser. No.12/970,780 filed Dec. 16, 2010 entitled STRING AND SUB-STRING SEARCHINGUSING INVERTED INDEXES, the disclosure of which is incorporated hereinby reference.

TECHNICAL FIELD

The subject matter described herein relates to techniques, systems, andarticles for string and sub-string searching using inverted indexes.

BACKGROUND

Classical database systems store textual content in simple stringcolumns. With such arrangements, searching can only be performed forsequences of characters and speed of execution is moderate. For the moststate-of-the-art databases, it is also possible to create additionalfull-text indexes on string columns. That is, the text is split intowords, and a positional inverted index is created on these words. Usingthe index, it is possible to search for phrases (sequences of words),and it is also possible to answer Boolean queries on a word level.However, this approach has two major drawbacks. First, large parts ofthe data must be stored twice (as string data and within the invertedindex). Second, searching for substrings (sequences of characters) iscomparatively slow because such searching is performed on raw data.

SUMMARY

In one aspect, a search query of a collection of electronic documents isparsed to identify one or more terms and/or one or more term separators.Thereafter, at least one terms inverted list corresponding to at leastone identified term is retrieved from a terms positional inverted index(if present in the query). The terms positional inverted index comprisesa first plurality of inverted lists mapping exact representations ofterms to documents and associated document positions within thecollection of electronic documents. In addition, at least one separatorsinverted list corresponding to at least one identified separator isretrieved from a separators positional inverted index (if present in thequery). The separators positional inverted index comprises a secondplurality of inverted lists mapping term separators to documents andassociated document positions within the collection of electronicdocuments. Further, the separators position inverted index is separateand distinct from the terms positional inverted index. Documents commonto the retrieved at least one terms inverted list and to the retrievedat least one separators inverted list are then identified so thatprovision of data characterizing the identified documents can beinitiated.

The provision of data can include one or more of: transmitting at leasta portion of the data characterizing the identified documents (e.g.,data identifying a location of the identified documents, etc.),persisting at least a portion of the data characterizing the identifieddocuments, and/or displaying at least a portion of the datacharacterizing the identified documents.

The term separators can be one or more of: periods, spaces, commas,colons, semi-colons and exclamation points.

The first plurality of inverted lists can further map normalizedrepresentations of terms to documents within the collection ofelectronic documents. The first plurality of inverted lists can furthermap normalized representations of each term to its variants. The parsed(query-)terms can be substrings (prefixes or suffixes) of words (asopposed to the entire word).

In another aspect, a search query of a collection of electronicdocuments is split into words and separators. If the number of words andseparators are greater than 1, then a suffix search is executed in theterms positional inverted index and a prefix search is conducted (whichcan be executed in parallel to the suffix search) to each retrieveresponsive inverted lists. Thereafter, positional inverted lists areretrieved for each part in between (if any) and all of the invertedlists are combined after taking into consideration term/separatorpositions. Provision of data characterizing these results can then beinitiated. If there is only a single search term or separator theninverted lists are retrieved (rather than performing the suffix andprefix searching.

In a further aspect, a search query of a collection of electronicdocuments is parsed to identify one or more terms (if any) and one ormore term separators (if any). Thereafter, at least one terms invertedlist is retrieved from a terms positional inverted index thatcorresponds to at least one identified term (if present). The termspositional inverted index comprises a first plurality of inverted listsmapping exact representations of terms to documents and associateddocument positions within the collection of electronic documents. Inaddition, at least one first separators inverted list corresponding toat least one identified separator (if present) is retrieved from a firstseparators positional inverted index. The first separators positionalinverted index comprises a second plurality of inverted lists mappingterm separators to documents and associated document positions withinthe collection of electronic documents. The first separators positionalinverted index is separate from the terms positional inverted index. Inaddition, at least one second separators inverted list corresponding toat least one identified separator (if present) is retrieved from asecond separators positional inverted index. The second separatorspositional inverted index comprises a third plurality of inverted listsmapping term separators to documents and associated document positionswithin the collection of electronic documents. The second separatorspositional inverted index is separate from the terms positional invertedindex and the first separators positional inverted index. The first andsecond separators positional inverted indexes are disjoint. Documentscomment to each of the retrieved at least one terms inverted list (ifretrieved), the retrieved at least one first separators inverted list(if retrieved), and the at least one second separators inverted list (ifretrieved) can be identified so that provision of data characterizingthe identified documents can be initiated.

In some implementations, there can be more than one separator invertedindex and such inverted indexes can be pairwise disjoint. For example,one separator inverted index can be directed solely to punctuation whileanother separator inverted index can be directed to spacing (e.g.,spaces, tabs, line-breaks). Such an arrangement can provide fastersearches for queries containing words and punctuation only.

Articles of manufacture are also described that comprise computerexecutable instructions permanently stored on computer readable media,which, when executed by a computer, causes the computer to performoperations herein. Similarly, computer systems are also described thatmay include a processor and a memory coupled to the processor. Thememory may temporarily or permanently store one or more programs thatcause the processor to perform one or more of the operations describedherein. In addition, for computer-implemented methods the recitedoperations can be implemented by one or more data processors (which maybe part of a single computing system or distributed amongst differentcomputing systems).

The subject matter described herein provides many advantages. Forexample, the current subject matter enables fast string searching withfast word-based searching while at the same time avoiding memoryintensive data redundancy.

The details of one or more variations of the subject matter describedherein are set forth in the accompanying drawings and the descriptionbelow. Other features and advantages of the subject matter describedherein will be apparent from the description and drawings, and from theclaims.

DESCRIPTION OF DRAWINGS

FIG. 1 is a process flow diagram illustrating retrieval of documentsusing first and second inverted indexes;

FIG. 2 is a diagram illustrating a search engine and a database havingfirst and second inverted indexes; and

FIG. 3 is a diagram illustrating sub-string searching execution.

DETAILED DESCRIPTION

FIG. 1 is a process flow diagram 100 illustrating a method in which, at110, a search query of a collection of electronic documents is parsed toidentify one or more terms and/or one or more term separators.Thereafter, at 120, at least one terms inverted list corresponding to atleast one identified term (if present in the query) is retrieved from aterms positional inverted index. The terms positional inverted indexcomprises a first plurality of inverted lists mapping exactrepresentations of terms to documents and associated document positionswithin the collection of electronic documents. In addition, at 130, atleast one separators inverted list corresponding to at least oneidentified separator is retrieved (if present in the query) from aseparators positional inverted index. The separators positional indexcomprises a second plurality of inverted lists mapping term separatorsto documents and associated document positions within the collection ofelectronic documents. The separators position inverted index is separateand distinct from the terms positional inverted index. Subsequently, at140, documents common to the retrieved at least one terms inverted list(if retrieved) and to the retrieved at least one separators invertedlist (if retrieved) are identified. Provision of data characterizing theidentified documents can, at 150, then be initiated.

FIG. 2 is a diagram 200 illustrating a search engine 210 which can polla database 220 for documents responsive to a query. While the searchengine 210 is illustrated as a separate module, the search engine 210can include one or more or all of the components included in FIG. 2. Thedatabase 220 includes a first inverted index 230 and a second invertedindex 240 both of which are used to identify documents stored within thedatabase that are responsive to a query. The first inverted index 230comprises a positional inverted index for terms and a correspondingfirst plurality of inverted lists 232 which map terms to documentswithin the database 220 and additionally identifies positions of suchterms within the documents. The second inverted index 240 comprises aterms positional inverted index for terms separators and a correspondingsecond plurality of inverted lists 232 that map term separators todocuments within the database 220 and additionally identifies positionsof such term separators within the documents.

The inverted lists 232, 242 can be organized and configured in variousmanners to facilitate efficient searching of the inverted indexes 230,240. For example, a long inverted list can be supplemented with a shortlist of pointers to places in the long list to avoid having to read theentire long list up to a given point of interest. The short list ofpointers can be optimized depending on a variety of factors includingsystems resources, types of indexed documents, and the like.

The term database as used herein refers to a collection of one or moredocuments which in this context means a set of electronic data (bothelectronic data stored in a file and electric data received over anetwork). A document does not necessarily correspond to a file. Adocument can be stored in a portion of a file that holds otherdocuments, in a single file dedicated to the document in question, or ina set of coordinated files. The documents may be text documents and/orother types of electronic documents including audio, video, pictureADOBE FLASH media files, and other forms of media. For example, a videofile may have an associated description (e.g., the description may formpart of the metadata/attributes of the video file, etc.) that may beindexed and the video may be presented to the user as a search result.

The search engine 210 when evaluating a query traverses the firstplurality of inverted lists 232 for each index term included in thequery as well as the second plurality of inverted lists 242 for eachterm separator included in the query (the sequence of such traversalscan be reversed or performed in parallel). For example, evaluating aquery formed using Boolean logic may require traversing more than oneinverted list depending on the operator, such as OR (the union ofinverted lists), AND (an intersection of inverted lists), and the like,or a proximity operator (an intersection of inverted lists), as well asseparators as described below. Evaluating a phrase query can be achievedby combining the inverted lists for the query terms to identify matchingdocuments. Positional information of both the terms and the termseparators can be used to further filter matching documents.

The first inverted index 230 is a word-based positional inverted indexthat contains a dictionary of terms built on exact terms rather than onnormalized terms (as well as positional information of the terms withinthe associated documents). Stated differently, variations such ascapitalization and the like are taken into account by the correspondingfirst plurality of inverted lists 232. In addition, the first invertedindex 230 can also store a (1:n)-mapping from each normalized term toits variants. With the latter arrangement, the same dictionary as wellas the same inverted lists can be used for traditional text search(e.g., searching for normalized terms, etc.). In other words, bybuilding the union of the lists of all variants, the inverted list issimilar to a conventional inverted index.

The second inverted index 240, in contrast to the first inverted index230, is a positional inverted index that indexes character sequencesthat are skipped while terms are extracted for the first inverted index230 (as well as positional information of such character sequenceswithin the associated documents). As used herein, these charactersequences are referred to a “term separators” and can includedesignations other than words/terms such as punctuation elementsincluding spaces, commas, exclamation points, colons, semi-colons, andperiods.

As the amount of data stored in the dictionaries of the inverted indexesis very small as compared to the raw string data stored in the database220 and fast pattern search (using, for example, suffix arrays, etc.)can be performed on the entries in the first and second plurality oflists 232, 242 that are unique. The following provides varioustechniques which can be implemented using the first and second invertedindexes 230, 240.

Word-based searching. With a word-based searching approach, invertedlists 232 from the first inverted index 230 of all exact variants of thenormalized query terms are retrieved using normalized-to-exact mapping.Thereafter, the matching inverted lists 232 are combined for each termand data characterizing such documents corresponding to the combinationcan be provided (e.g., displayed, transmitted, persisted, etc.). In someimplementations, optimizations/relevancy determinations can be appliedto the documents responsive to the query. In addition, operators canalso be applied between the combined matching inverted lists 232 of thedifferent terms (e.g., AND, OR, etc.).

String search: With a string search approach, the query string is firstsplit/parsed into interleaved sequences of words and term separators.Thereafter, a phrase search (i.e., a search specifying the exactterms/term separators and their relative positions) is conducted on thefirst inverted index 230 and the second inverted index 240 (the querymust cover the complete cell in both cases). The results from both ofthe inverted indexes 230, 240 are then merged to identify common hitswhich are then mapped to associated documents. Data characterizing suchdocuments can be then be provided (e.g., displayed, transmitted,persisted, etc.).

Substring search: With a substring approach, and with reference to thediagram 300 of FIG. 3, the query string, at 305, is split/parsed intointerleaved sequences of words and term separators. It is thendetermined, at 310, whether there is more than one word or termseparator. If that is the case, at 315, a suffix search is then executedfor the first query part and, additionally, at 325, a prefix search isexecuted for the last query part—both within the exact terms of invertedlists 232 to result in respective inverted lists 320, 330. Thereafter,at 335, positional inverted lists are then retrieved for any word partsin between the prefix and suffix (if any). All of the retrievedpositional inverted lists are combined, at 340, considering word/termseparator positions and later, at 355, results can be provided. If, at310, it is determined that there is only one word or term separatorthen, at 345, a pattern search is retrieved for such word or termseparator, and at 350, the responsive inverted lists are retrieved andcombined. The results, at 355, can then be provided.

Text-reconstruction. With a text reconstruction approach, techniquessuch as those described in U.S. patent application Ser. No. 12/056,856entitled: “Compressed Storage of Documents using Inverted Indexes” (thecontents of which are hereby fully incorporated by reference) can beutilized. Namely, word sequences and term separator sequences can beboth used to reconstruct the corresponding documents in the respectiveinverted indexes 230, 240. Thereafter, the word and term separatorsequences can be interleaved. By having the exact terms/separators andcorresponding position in the index, it is possible to reconstruct theterm/separator sequence for each document. In the above-referencedpatent application, such reconstruction is accelerating using a“bag-of-words”, that is, in addition to the indexes, the database 220stores, for each document, the IDs of all terms occurring in thedocument. The term sequences can be generated using the positioninverted index and there is a difference between the term sequence andthe indexed document. This difference can be stored explicitly accordingto the above-referenced patent application; however, with the currenttechniques, there is no need to store the differences because exactterms are stored and there is an index over the separator (withcorresponding “bags-of-separators”).

In some cases, especially when queries will likely include only wordsand punctuation, there can be more than one separator inverted index andsuch inverted indexes can be pairwise disjoint (i.e., they can relate todifferent term separators, etc.). For example, one separator invertedindex can be directed solely to punctuation while another separatorinverted index can be directed to spacing (e.g., spaces, tabs,line-breaks). In such a case, the inverted lists, if any, responsive tothe query can be retrieved from each inverted index in order to identifyresponsive documents containing all of the query terms.

Various implementations of the subject matter described herein may berealized in digital electronic circuitry, integrated circuitry,specially designed ASICs (application specific integrated circuits),computer hardware, firmware, software, and/or combinations thereof.These various implementations may include implementation in one or morecomputer programs that are executable and/or interpretable on aprogrammable system including at least one programmable processor, whichmay be special or general purpose, coupled to receive data andinstructions from, and to transmit data and instructions to, a storagesystem, at least one input device, and at least one output device.

These computer programs (also known as programs, software, softwareapplications or code) include machine instructions for a programmableprocessor, and may be implemented in a high-level procedural and/orobject-oriented programming language, and/or in assembly/machinelanguage. As used herein, the term “machine-readable medium” refers toany computer program product, apparatus and/or device (e.g., magneticdiscs, optical disks, memory, Programmable Logic Devices (PLDs)) used toprovide machine instructions and/or data to a programmable processor,including a machine-readable medium that receives machine instructionsas a machine-readable signal. The term “machine-readable signal” refersto any signal used to provide machine instructions and/or data to aprogrammable processor.

To provide for interaction with a user, the subject matter describedherein may be implemented on a computer having a display device (e.g., aCRT (cathode ray tube) or LCD (liquid crystal display) monitor) fordisplaying information to the user and a keyboard and a pointing device(e.g., a mouse or a trackball) by which the user may provide input tothe computer. Other kinds of devices may be used to provide forinteraction with a user as well; for example, feedback provided to theuser may be any form of sensory feedback (e.g., visual feedback,auditory feedback, or tactile feedback); and input from the user may bereceived in any form, including acoustic, speech, or tactile input.

The subject matter described herein may be implemented in a computingsystem that includes a back-end component (e.g., as a data server), orthat includes a middleware component (e.g., an application server), orthat includes a front-end component (e.g., a client computer having agraphical user interface or a Web browser through which a user mayinteract with an implementation of the subject matter described herein),or any combination of such back-end, middleware, or front-endcomponents. The components of the system may be interconnected by anyform or medium of digital data communication (e.g., a communicationnetwork). Examples of communication networks include a local areanetwork (“LAN”), a wide area network (“WAN”), and the Internet.

The computing system may include clients and servers. A client andserver are generally remote from each other and typically interactthrough a communication network. The relationship of client and serverarises by virtue of computer programs running on the respectivecomputers and having a client-server relationship to each other.

Although a few variations have been described in detail above, othermodifications are possible. For example, the logic flow depicted in theaccompanying figures and described herein do not require the particularorder shown, or sequential order, to achieve desirable results. Otherembodiments may be within the scope of the following claims.

What is claimed is:
 1. A computer implemented method comprising: parsinga search query of a collection of electronic documents to identify oneor more terms and/or one or more term separators; retrieving, from aterms positional inverted index, at least one terms inverted listcorresponding to at least one identified term if identified in thesearch query, the terms positional inverted index comprising a firstplurality of inverted lists mapping exact representations of terms todocuments and associated document positions within the collection ofelectronic documents; retrieving, from a separators positional invertedindex, at least one separators inverted list corresponding to at leastone identified separator if identified in the search query, theseparators positional inverted index comprising a second plurality ofinverted lists mapping term separators to documents and associateddocument positions within the collection of electronic documents, theseparators positional inverted index being separate from the termspositional inverted index; identifying documents from the retrieved atleast one terms inverted list and/or to the retrieved at least oneseparators inverted list responsive to the search query; and initiatingprovision of data characterizing the identified documents.
 2. A methodas in claim 1, wherein the initiating comprises: transmitting at least aportion of the data characterizing the identified documents, wherein thedata identifies a location of the identified documents.
 3. A method asin claim 1, wherein the initiating comprises: persisting at least aportion of the data characterizing the identified documents.
 4. A methodas in claim 1, wherein the initiating comprises: displaying at least aportion of the data characterizing the identified documents.
 5. A methodas in claim 1, wherein the term separators are selected from a groupcomprising: periods, spaces, tabs, line-breaks, commas, colons,semi-colons and exclamation points.
 6. A method as in claim 1, whereinthe first plurality of inverted lists further map normalizedrepresentations of terms to documents within the collection ofelectronic documents.
 7. A method as in claim 6, wherein the firstplurality of inverted lists further map normalized representations ofeach term to its variants.
 8. A method as in claim 1, wherein the parsedterms comprise substrings of words.
 9. A method as in claim 1, furthercomprising splitting the query into interleaved sequences of words andterm separators; and wherein: retrieving from the terms positionalinverted index comprises performing a phrase search on the termspositional inverted index; and retrieving from the separators positionalinverted index comprises performing a phrase search on the separatorspositional inverted index.
 10. An article of manufacture comprising:computer executable instructions non-transitorily stored on computerreadable media, which, when executed by a computer, causes the computerto perform operations comprising: parsing a search query of a collectionof electronic documents to identify one or more terms and one or moreterm separators; retrieving, from a terms positional inverted index, atleast one terms inverted list corresponding to at least one identifiedterm, the terms positional inverted index comprising a first pluralityof inverted lists mapping exact representations of terms to documentsand associated document positions within the collection of electronicdocuments; retrieving, from a separators positional inverted index, atleast one separators inverted list corresponding to at least oneidentified separator, the separators positional inverted indexcomprising a second plurality of inverted lists mapping term separatorsto documents and associated document positions within the collection ofelectronic documents, the separators positional inverted index beingseparate from the terms positional inverted index; identifying documentscommon to the retrieved at least one terms inverted list and to theretrieved at least one separators inverted list; and initiatingprovision of data characterizing the identified documents.
 11. Anarticle as in claim 10, wherein the initiating comprises: transmittingat least a portion of the data characterizing the identified documents,wherein the data identifies a location of the identified documents. 12.An article as in claim 10, wherein the initiating comprises: persistingat least a portion of the data characterizing the identified documents.13. An article as in claim 10, wherein the initiating comprises:displaying at least a portion of the data characterizing the identifieddocuments.
 14. An article as in claim 10, wherein the term separatorsare selected from a group comprising: periods, spaces, tabs,line-breaks, commas, colons, semi-colons and exclamation points.
 15. Anarticle as in claim 10, wherein the first plurality of inverted listsfurther map normalized representations of terms to documents within thecollection of electronic documents.
 16. An article as in claim 15,wherein the first plurality of inverted lists further map normalizedrepresentations of each term to its variants.
 17. An article as in claim10, wherein the parsed terms comprise substrings of words.
 18. Anarticle as in claim 10, wherein the operations further comprise:splitting the query into interleaved sequences of words and termseparators; and wherein: retrieving from the terms positional invertedindex comprises performing a phrase search on the terms positionalinverted index; and retrieving from the separators positional invertedindex comprises performing a phrase search on the separators positionalinverted index.
 19. A method comprising: parsing a search query of acollection of electronic documents to identify one or more terms and oneor more term separators; retrieving, from a terms positional invertedindex, at least one terms inverted list corresponding to at least oneidentified term, the terms positional inverted index comprising a firstplurality of inverted lists mapping exact representations of terms todocuments and associated document positions within the collection ofelectronic documents; retrieving, from a first separators positionalinverted index, at least one first separators inverted listcorresponding to at least one identified separator, the first separatorspositional inverted index comprising a second plurality of invertedlists mapping term separators to documents and associated documentpositions within the collection of electronic documents, the firstseparators positional inverted index being separate from the termspositional inverted index; retrieving, from a second separatorspositional inverted index, at least one second separators inverted listcorresponding to at least one identified separator, the secondseparators positional inverted index comprising a third plurality ofinverted lists mapping term separators to documents and associateddocument positions within the collection of electronic documents, thesecond separators positional inverted index being separate from theterms positional inverted index and the first separators positionalinverted index, the first and second separators positional invertedindexes being disjoint; identifying documents common to each of theretrieved at least one terms inverted list, the retrieved at least onefirst separators inverted list, and the at least one second separatorsinverted list; and initiating provision of data characterizing theidentified documents.
 20. A method as in claim 19, wherein: retrievingfrom the terms positional inverted index comprises performing a phrasesearch on the terms positional inverted index; and retrieving from theseparators positional inverted index comprises performing a phrasesearch on the separators positional inverted index.